The permutation-path coloring problem on trees
نویسندگان
چکیده
منابع مشابه
The permutation-path coloring problem on trees
In this paper we rst show that the permutation-path coloring problem is NP-hard even for very restrictive instances like involutions, which are permutations that contain only cycles of length at most two, on both binary trees and on trees having only two vertices with degree greater than two, and for circular permutations which are permutations that contain exactly one cycle on trees with maxim...
متن کاملRandomized path coloring on binary trees
Motivated by the problem of WDM routing in all–optical networks, we study the following NP–hard problem. We are given a directed binary tree T and a set R of directed paths on T . We wish to assign colors to paths in R, in such a way that no two paths that share a directed arc of T are assigned the same color and that the total number of colors used is minimized. Our results are expressed in te...
متن کاملThe Longest Path Problem on Permutation Graphs
The longest path problem on graph G is a classic problem which is to find a simple path such that the number of vertices of the path is maximum among all possible paths of G. In this paper, we show that the longest path problem can be solved in linear time on permutation graphs.
متن کاملThe black-and-white coloring problem on permutation graphs
Given a graph G and integers b and w. The black-and-white coloring problem asks if there exist disjoint sets of vertices B and W with |B| = b and |W| = w such that no vertex in B is adjacent to any vertex in W. In this paper we show that the problem is polynomial when restricted to permutation graphs.
متن کاملOn the K shortest path trees problem
We address the problem for finding the K best path trees connecting a source node with any other non-source node in a directed network with arbitrary lengths. The main result in this paper is the proof that the kth shortest path tree is adjacent to at least one of the previous (k−1) shortest path trees. Consequently, we design an O(+Km) time and O(K+m) space algorithm to determine the K shortes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2003
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00635-7